Progression of Situation Calculus Action Theories with Incomplete Information
نویسندگان
چکیده
• Each table in the database has one column and stores the possible values for a ground fluent term. •Whenever there is complete knowledge about the term, the corresponding table has exactly one row. E.g., the ground fluent term door has only one possible value (Closed ) and so the table for door has exactly one row: Closed. •Whenever there is incomplete knowledge, the table has more than one rows that list all the possible values for the term. E.g., the table for orb has two rows: Room1 and Room2. • In the general case, a table in the database may store the possible values for a tuple of ground fluent terms (read on!).
منابع مشابه
Progression and verification of situation calculus agents with bounded beliefs
In this paper we investigate agents that have incomplete information and make decisions based on their beliefs, expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently it has been shown that verifying temporal properties over such theories i...
متن کاملTowards an Expressive Decidable Logical Action Theory
In the area of reasoning about actions, one of the key computational problems is the projection problem: to find whether a given logical formula is true after performing a sequence of actions. This problem is undecidable in the general situation calculus; however, it is decidable in some fragments. We consider a fragment P of the situation calculus and Reiter’s basic action theories (BAT) such ...
متن کاملTowards an Expressive Practical Logical Action Theory
In the area of reasoning about actions, one of the key computational problems is the projection problem: to find whether a given logical formula is true after performing a sequence of actions. This problem is undecidable in the general situation calculus; however, it is decidable in some fragments. We consider a fragment P of the situation calculus and Reiter’s basic action theories (BAT) such ...
متن کاملScaling Up Reasoning about Actions Using Relational Database Technology
Reiter’s variant of the Situation Calculus is tightly related to relational databases, when complete information on the initial situation is available. In particular, the information on the initial situation can be seen as a relational database, and actions, as specified by the preconditions and successor state axioms, can be seen as operations that change the state of the database. In this pap...
متن کاملIncomplete Causal Laws in the Situation Calculus Using Free Fluents
We propose a simple relaxation of Reiter’s basic action theories, based on fluents without successor state axioms, that accommodates incompleteness beyond the initial database. We prove that fundamental results about basic action theories can be fully recovered and that the generalized framework allows for natural specifications of various forms of incomplete causal laws. We illustrate this by ...
متن کامل